-
1 nonplanar graph
граф, который нельзя изобразить на плоскости так, чтобы его рёбра не пересекалисьAnt:Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > nonplanar graph
-
2 nonplanar graph
Большой англо-русский и русско-английский словарь > nonplanar graph
-
3 nonplanar graph
Математика: непланарный граф (неплоский) -
4 nonplanar graph
-
5 nonplanar graph
непланарный графEnglish-Russian dictionary of technical terms > nonplanar graph
-
6 nonplanar graph
мат.непланарный [неплоский] граф -
7 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
8 nonplanar
Большой англо-русский и русско-английский словарь > nonplanar
-
9 planar graph
планарный граф, плоский графграф, который может быть изображён на плосковсти так, что его рёбра не пересекаютсяAnt:см. тж. graphАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > planar graph
-
10 непланарный граф
-
11 непланарный граф
-
12 непланарный граф
nonplanar graph мат.Русско-английский научно-технический словарь Масловского > непланарный граф
-
13 непланарный граф
Большой англо-русский и русско-английский словарь > непланарный граф
-
14 непланарный граф
Mathematics: nonplanar graph (неплоский)
См. также в других словарях:
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Triangle-free graph — In the mathematical area of graph theory, a triangle free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4,… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
Line graph — This article is about the mathematical concept. For statistical presentation method, see line chart. In graph theory, the line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name… … Wikipedia
Desargues graph — Named after Gérard Desargues Vertices 20 Edges 30 … Wikipedia
Complete graph — K7, a complete graph with 7 vertices Vertices n Edges … Wikipedia
Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected … Wikipedia
Snark (graph theory) — In graph theory, a snark is a connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it is a graph in which every vertex has three neighbors, and the edges cannot be colored by three colors without two edges of the… … Wikipedia